Two step Newton and Steffensen type methods for solving non-linear equations
نویسندگان
چکیده
منابع مشابه
A Modified Newton Method for Solving Non-linear Algebraic Equations
The Newton algorithm based on the “continuation” method may be written as being governed by the equation ( ) j x t + 1 ( ) 0, ij i j B F x − = where Fi (xj) = 0, i, j = 1, ...n are nonlinear algebraic equations (NAEs) to be solved, and Bij = ∂Fi /∂xj is the corresponding Jacobian matrix. It is known that the Newton’s algorithm is quadratically convergent; however, it has some drawbacks, such as...
متن کاملTwo-step Newton methods
We present sufficient convergence conditions for two-step Newton methods in order to approximate a locally unique solution of a nonlinear equation in a Banach space setting. The advantages of our approach under the same computational cost over other studies such as [9–25] for the semilocal convergence case are: weaker sufficient convergence conditions, more precise error bounds on the distances...
متن کاملModified homotopy perturbation method for solving non-linear oscillator's equations
In this paper a new form of the homptopy perturbation method is used for solving oscillator differential equation, which yields the Maclaurin series of the exact solution. Nonlinear vibration problems and differential equation oscillations have crucial importance in all areas of science and engineering. These equations equip a significant mathematical model for dynamical systems. The accuracy o...
متن کاملInexact Newton Methods for Solving Nonsmooth Equations
This paper investigates inexact Newton methods for solving systems of nonsmooth equations. We de ne two inexact Newton methods for locally Lipschitz functions and we prove local (linear and superlinear) convergence results under the assumptions of semismoothness and BD-regularity at the solution. We introduce a globally convergent inexact iteration function based method. We discuss implementati...
متن کاملAdaptive Steffensen-like Methods with Memory for Solving Nonlinear Equations with the Highest Possible Efficiency Indices
The primary goal of this work is to introduce two adaptive Steffensen-like methods with memory of the highest efficiency indices. In the existing methods, to improve the convergence order applied to memory concept, the focus has only been on the current and previous iteration. However, it is possible to improve the accelerators. Therefore, we achieve superior convergence orders and obtain as hi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tbilisi Mathematical Journal
سال: 2012
ISSN: 1875-158X
DOI: 10.32513/tbilisi/1528768886